|
The ''k''-minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly ''k'' vertices and forms a subgraph of a larger graph. It is also called the ''k''-MST or edge-weighted ''k''-cardinality tree. Finding this tree is NP-hard, but it can be approximated to within a constant approximation ratio in polynomial time. The input to the problem consists of an undirected graph with weights on its edges, and a number ''k''. The output is a tree with ''k'' vertices and ''k'' − 1 edges, with all of the edges of the output tree belonging to the input graph. The cost of the output is the sum of the weights of its edges, and the goal is to find the tree that has minimum cost. The ''k''-MST problem has been shown to be NP-hard by a reduction from the Steiner tree problem. The best approximation known for the problem achieves an approximation ratio of 2, and is by . This approximation relies heavily on the primal-dual schema of . When the input consists of points in the Euclidean plane (any two of which can be connected in the tree with cost equal to their distance) there exists a polynomial time approximation scheme devised by . ==References== *. *. *. *. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「K-minimum spanning tree」の詳細全文を読む スポンサード リンク
|